Volume rendering using seed-filling acceleration: supporting cut planes by fast reseeding.
نویسندگان
چکیده
OBJECTIVE Seed filling in view lattice is a method for accelerating volume rendering. Our previously published results on using seed filling had the limitation that they did not support cut planes. Cut planes are one of the main advantages of using volume rendering over surface rendering. In this article we describe the seed-filling acceleration technique and propose two fast reseeding processes that may be performed for each frame. MATERIALS AND METHODS The reseeding process performs a connected component search on the cut plane within the volume data set. The amount of processing done by a connected component search algorithm is proportional to N(2), assuming the data set size is N(3). We implemented two connected component search algorithms: one for orthogonal cut planes and another for oblique cut planes. We measured the time taken by the cutting and estimated the effect on the rendering performance when the cut plane was moved interactively. RESULTS Our measurements show that rendering rates of several frames per second can be achieved with a 266-MHz Pentium II PC, even when the object is interactively modified with cut planes during the rendering. CONCLUSIONS We have shown that the seed-filling algorithm is also applicable in situations where the displayed data is modified interactively using cut planes or objects. Applications in this regard include, for example, computer-aided surgery systems, where the instrument may be used to interactively perform the simulated cut in the data set.
منابع مشابه
Using 3-Dimensional Seed Filling in View Space to Accelerate Volume Rendering
This paper presents and evaluates a novel method for projecting a three-dimensional volumetric 6-connected object onto a 2D view using seed filling in the view space. Resampling a 6-connected volume by ray casting produces a new 6-connected volume, provided that the sampling rate is high enough. This new volume can be projected by a 3-dimensional seed filling algorithm. We implement and evaluat...
متن کاملInteractive Volume - Rendering Techniques for Medical Data Visualization
Direct volume rendering is a flexible but computationally expensive method for visualizing 3D sampled data. Because of the enormous number of voxels (volume elements) to be processed, it is hardly possible to interactively render a high-resolution volume using brute force algorithms like the classical ray casting or splatting on a recent single-processor machine. One alternative is to apply har...
متن کاملUsing Projection to Accelerate Ray Tracing
Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...
متن کاملCellFast: Interactive Unstructured Volume Rendering
Shirley and Tuchman’s projected tetrahedra approach is a fast algorithm for unstructured volume visualization, because it generates triangles that may be rendered by hardware acceleration. In this paper, I explore optimizations using OpenGL triangle fans, customized quicksort, memory organization for cache efficiency, display lists, and tetrahedral culling. The optimizations improve the perform...
متن کاملEffective LFSR Reseeding Technique for Achieving Reduced Test Pattern
Aim of this study is to focus on reducing test pattern with effective Linear Feedback Shift Register (LFSR) reseeding. Test data volume of modern devices for testing increases rapidly corresponding to the size and complexity of the Systems-on-Chip (SoC). LFSR is a good pseudorandom pattern generator, which generates all possible test vectors with the help of the tap sequence. It can achieve hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer aided surgery : official journal of the International Society for Computer Aided Surgery
دوره 4 4 شماره
صفحات -
تاریخ انتشار 1999